/* Copyright (C) 2013-2021 TU Dortmund
 * This file is part of LearnLib, http://www.learnlib.de/.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package de.learnlib.algorithms.ttt.base;

/**
 * Class that contains all data that represent the internal state of the {@link AbstractTTTLearner} learner and its DFA
 * and Mealy implementations.
 *
 * @param <I>
 *         The input alphabet type.
 * @param <D>
 *         The output domain type.
 *
 * @author bainczyk
 */
public class TTTLearnerState<I, D> {

    private final AbstractTTTHypothesis<I, D, ?> hypothesis;
    private final BaseTTTDiscriminationTree<I, D> discriminationTree;

    TTTLearnerState(final AbstractTTTHypothesis<I, D, ?> hypothesis,
                    final BaseTTTDiscriminationTree<I, D> discriminationTree) {

        this.hypothesis = hypothesis;
        this.discriminationTree = discriminationTree;
    }

    AbstractTTTHypothesis<I, D, ?> getHypothesis() {
        return hypothesis;
    }

    BaseTTTDiscriminationTree<I, D> getDiscriminationTree() {
        return discriminationTree;
    }
}
